Beautiful Landscape Design with Minimum Light
نویسندگان
چکیده
منابع مشابه
Ecological Design of Urban Landscape
Paying attention to the spatial placement of the elements (man-made or natural) based on the landscape pattern and ecological processes in urban design would have a considerable impact on both human and the nature. In a way that the discords in the placement of patchs in respect to each other, or in respect to visual corridors and urban matrixes lead to the unwanted results in the cities. The e...
متن کاملBeautiful Parallel Code: Evolution vs. Intelligent Design
The individual node of a massively parallel distributed memory cluster is now itself a complex parallel computer with multiple processors, each of which may have multiple cores and/or hardware accelerators. We focus on the question of how to effectively code such nodes targeting the problem domain of dense matrix computations. We argue that the traditional way of programming leads to a level of...
متن کاملLandscape Design of Roads and Environmental Ethics
Background: The road to respond to the needs of today's modern world, affected by the advancement of technological tools, seeks to increase speed and increasing safety. This study seeks to improve the landscape quality of roads, explains the effective criteria in road design and the need to pay attention to the category of design ethics and emphasizes them. Conclusion: In order to increase the...
متن کاملOptimum Design of BrushLess DC Motor with Minimum Torque Pulsation using FEM & PSO
Despite many advantages of BrushLess DC motor, torque pulsation is one of the most important disadvantages of it. At first, an optimum primary design of BLDC motor is done using PSO algorithm. Then, other parameters for reducing the torque pulsation are considered by finite element method. It is shown that fractional slot structure has many advantages than conventional one. Both cogging and rip...
متن کاملIncremental Network Design with Minimum Spanning Trees
Given an edge-weighted graph G = (V,E) and a set E0 ⊂ E, the incremental network design problem with minimum spanning trees asks for a sequence of edges e1, . . . , e ′ r ∈ E \ E0 minimizing ∑T t=1 w(Xt) where w(Xt) is the weight of a minimum spanning tree Xt for the subgraph (V,E0 ∪ {e1, . . . , et}) and T = |E \ E0|. We prove that this problem can be solved by a greedy algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Illuminating Engineering Institute of Japan
سال: 1998
ISSN: 0019-2341,1349-838X,2185-1506
DOI: 10.2150/jieij1980.82.12_960